The list-decodability of random linear rank-metric codes is shown to matchthat of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linearrank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R =(1-\rho)(1-\frac{n}{m}\rho)-\varepsilon$ is shown to be (with high probability)list-decodable up to fractional radius $\rho \in (0,1)$ with lists of size atmost $\frac{C_{\rho,q}}{\varepsilon}$, where $C_{\rho,q}$ is a constantdepending only on $\rho$ and $q$. This matches the bound for random rank-metriccodes (up to constant factors). The proof adapts the approach of Guruswami,H\aa stad, Kopparty (STOC 2010), who established a similar result for theHamming metric case, to the rank-metric setting.
展开▼
